Faked states attack on quantum cryptosystems
نویسنده
چکیده
A new type of attack on quantum cryptography systems is proposed. In this attack, Eve utilizes various optical imperfections in Bob’s scheme and constructs light pulses so that Bob does not distinguish his detection results from normal, whereas they give Bob the basis and bit value chosen at Eve’s discretion. Applying this attack to systems with passive basis choice on Bob’s side is considered. Also, a general workflow of breaking into a running quantum cryptolink using this or Trojan horse attack is discussed.
منابع مشابه
Faked states attack using detector efficiency mismatch on SARG04, phase-time, DPSK, and Ekert protocols
In quantum cryptosystems, variations in detector efficiency can be exploited to stage a successful attack. This happens when the efficiencies of Bob’s two detectors are different functions of a control parameter accessible to Eve (e.g., timing of the incoming pulses). It has previously been shown that the Bennett-Brassard 1984 (BB84) protocol is vulnerable to this attack. In this paper, we show...
متن کاملFaked states attack and quantum cryptography protocols
Leveraging quantum mechanics, cryptographers have devised provably secure key sharing protocols[4], [3], [6], [17]. Despite proving the security in theory, real-world application falls short of the ideal. Last year, cryptanalysts completed an experiment demonstrating a successful eavesdropping attack on commercial quantum key distribution (QKD) systems[12]. This attack exploits a weakness in th...
متن کاملQuantum Key Distribution in the Presence of the Intercept-Resend with Faked States Attack
Despite the unconditionally secure theory of the Quantum Key Distribution (QKD), several attacks have been successfully implemented against commercial QKD systems. Those systems have exhibited some flaws, as the secret key rate of corresponding protocols remains unaltered, while the eavesdropper obtains the entire secret key. We propose the negative acknowledgment state quantum key distribution...
متن کاملPublic-Key Cryptosystems from the Worst-Case Shortest Vector Problem
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the length of a shortest nonzero vector in an n-dimensional lattice to within a small poly(n) factor. Prior cryptosystems with worst-case connections were based either on the shortest vector problem for a special class of lattices (Ajtai and Dwork, STOC 1997; Regev, J. ACM 2004), or on the co...
متن کاملDefeating Man-in-the-Middle Attack in Quantum Key Distribution
Quantum cryptosystems use some properties of quantum mechanics to create secret shared cryptographic keys that remain secret even against an eavesdropper with an access to unlimited computational power. All quantum key distribution (QKD) protocols require that the parties have access to an authentic channel. Otherwise, QKD is vulnerable to man-in-the-middle attacks. This paper studies QKD from ...
متن کامل